B . Becker , R . E . Bryant , O . Coudert , Ch . Meinel ( Hrsg
نویسندگان
چکیده
s of the Talks 7 Probabilistic Analysis of Large Finite State Machines F. Somenzi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 On Improving OBDD-Based Verification in a Synthesis Environment W. Kunz . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 On Computing the Maximum Power Cycle of Sequential Circuits A. Pardo . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 Timed Boolean Functions and their BDD’s R. K. Brayton . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 Ordered Kronecker Functional Decision Diagrams B. Becker, R. Drechsler, M. Theobald . . . . . . . . . . . . . . . . 9 Lists of Ternary Vectors – Concepts – Properties – Comparison with BDDs B. Steinbach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 On the Improvement of Variable Orderings for OBDDs B. Bollig . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 An Efficient OBDD-Rebuilding: Algorithm, Implementation, and Applications A. Slobodovà . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 Multi-Level Logic Synthesis Based on Kronecker and Boolean Ternary Decision Diagrams for Incompletely Specified Functions A. Sarabi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 Using Functions Properties for Multi-Level and Multi-Domain Logic Synthesis U. Kebschull . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 EXOR Ternary Decision Diagrams on EXOR Logic Synthesis T. Sasao . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 Hybrid Fault Simulation for Synchronous Sequential Circuits Based on OBDDs R. Krieger . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 A Symbolic Method to Reduce Power Consumption of Circuits Containing False Paths R. I. Bahar . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 Model Checking Commercial Designs C. Pixley . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 Efficient OBDD-based Boolean Manipulation C h. Meinel . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 BDD Minimization Based on Truth Table Permutations M. Fujita . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
منابع مشابه
Computer and Information Science, ISSN 1913-8989, Vol. 1, No. 2, May 2008
The pioneering work of Akers (1978) on graphical representation of Boolean functions using Binary Decision Diagrams (BDDs) offered an attractive and convenient technique for simplification and manipulation of complex Boolean functions. Modification of these BDDs was suggested by Bryant (1986) and since then different types of Decision Diagrams (DDs) have been introduced by researchers (see the ...
متن کاملPartitioned-ROBDDs: A Compact, Canonical and Efficiently Manipulatible Representation for Boolean Functions Ken McMillan A Conjunctively Decomposed Representation for Boolean Functions
The fourth workshop Decision Diagrams – Concepts and Applications in the series Computer Aided Design and Test at the IBFI SchloßDagstuhl was organized by Bernd Becker (Univ. Freiburg), Randy Bryant (Carnegie Mellon Univ.), Masahiro Fujita (Fujitsu Labs. San José) and Christoph Meinel (Univ. Trier). It was attended by 39 scientists. Binary Decision Diagrams (BDDs) have found widespread use in c...
متن کاملRemoval of Oxide Nanoparticles in a Model Wastewater Treatment Plant: Influence of Agglomeration and Surfactants on Clearing Efficiency
L U D W I G K . L I M B A C H , † R O B E R T B E R E I T E R , ‡ , § E L I S A B E T H M Ü L L E R , | R O L F K R E B S , § R E N É G Ä L L I , ‡ A N D W E N D E L I N J . S T A R K * , † Institute for Chemical and Bioengineering, Department of Chemistry and Applied Biosciences, ETH Zurich, CH-8093 Zurich, Switzerland, BMG Engineering AG, Ifangstrasse 11, CH-8952 Schlieren, Switzerland, Zuric...
متن کاملTranslation of Prepositions by Neural Networks
Translation of prepositions poses a very serious problem to machine translation because prepositions are highly ambigous. In theory prepo sitions can be disambiguated by a filter that excludes already generat ed representational objects with no selection restriction match between preposition and np, but it takes too long time in practice. A neurstl net work makes the disambiguation in fracti...
متن کامل